Graph complement conjecture for classes of shadow graphs
نویسندگان
چکیده
منابع مشابه
On the Graph Complement Conjecture for Minimum
The minimum rank of a graph has been an interesting and well studied parameter 6 investigated by many researchers over the past decade or so. One of the many unresolved questions on 7 this topic is the so-called graph complement conjecture, which grew out of a workshop in 2006. This 8 conjecture asks for an upper bound on the sum of the minimum rank of a graph and the minimum rank 9 of its comp...
متن کاملHadwiger’s conjecture on special classes of graphs
The Hadwiger number of a graph G is the largest integer n for which the complete graph on n vertices is a minor of G. Hadwiger conjectured that for any graph G, ,where is the chromatic number of G. We will address Hadwiger’s conjecture for circular arc graphs and their subfamilies. Circular arc graphs are graphs whose vertices can be represented as arcs on a circle such that any two vertices ar...
متن کاملOn the graph complement conjecture for minimum rank
The minimum rank of a graph has been an interesting and well studied parameter 6 investigated by many researchers over the past decade or so. One of the many unresolved questions on 7 this topic is the so-called graph complement conjecture, which grew out of a workshop in 2006. This 8 conjecture asks for an upper bound on the sum of the minimum rank of a graph and the minimum rank 9 of its comp...
متن کاملgraphs cospectral with a friendship graph or its complement
let $n$ be any positive integer and let $f_n$ be the friendship (or dutch windmill) graph with $2n+1$ vertices and $3n$ edges. here we study graphs with the same adjacency spectrum as the $f_n$. two graphs are called cospectral if the eigenvalues multiset of their adjacency matrices are the same. let $g$ be a graph cospectral with $f_n$. here we prove that if $g$ has no cycle of length $4$ or $...
متن کاملON NEW CLASSES OF MULTICONE GRAPHS DETERMINED BY THEIR SPECTRUMS
A multicone graph is defined to be join of a clique and a regular graph. A graph $ G $ is cospectral with graph $ H $ if their adjacency matrices have the same eigenvalues. A graph $ G $ is said to be determined by its spectrum or DS for short, if for any graph $ H $ with $ Spec(G)=Spec(H)$, we conclude that $ G $ is isomorphic to $ H $. In this paper, we present new classes of multicone graphs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operators and Matrices
سال: 2021
ISSN: 1846-3886
DOI: 10.7153/oam-2021-15-40